Bottom-up tree pushdown automata: classification and connection with rewrite systems

Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems

Coquidt, J.-L., M. Dauchet, R. Gilleron and S. VBgviilgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems, Theoretical Computer Science 127 (1994) 69-98. We define different types of bottom-up tree pushdown automata and study their connections with rewrite systems. Along this line of research we complete and generalize the results of Gallier, Book and Salom...

Synchronized Bottom-Up Tree Automata and L-Systems

Branching Pushdown Tree Automata

We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children of a tree node in possibly different control states but with identical stacks. We propose branching pushdown tree automata (BPTAs) as a solution. In a BPTA, a push-move views its matching pops as an unbounded, unorde...

Perfect Hashing with Pseudo-minimal Bottom-up Deterministic Tree Automata

We describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We al...

Nonlinear Tree Pattern Pushdown Automata

A new kind of an acyclic pushdown automaton for an ordered tree is presented. The nonlinear tree pattern pushdown automaton represents a complete index of the tree for nonlinear tree patterns and accepts all nonlinear tree patterns which match the tree. Given a tree with n nodes, the number of such nonlinear tree patterns is O((2+ v)n), where v is the number of variables in the patterns. We dis...